例句與造句

1. They extract significant behaviors using tree automata.
2. Tree automata deal with tree structures, rather than the strings of more conventional state machines.
3. As with classical automata, finite tree automata ( FTA ) can be either a deterministic automaton or not.
4. The regular tree languages are also the languages recognized by bottom-up tree automata and nondeterministic top-down tree automata.
5. The regular tree languages are also the languages recognized by bottom-up tree automata and nondeterministic top-down tree automata.
6. It's difficult to find tree automata in a sentence. 用tree automata造句挺難的
7. For tree automata, transition rules are rewrite rules; and for top-down ones, the left-hand side will be parent nodes.
8. According to how the automaton processes the input tree, finite tree automata can be of two types : ( a ) bottom up, ( b ) top down.
9. Non-deterministic top-down tree automata have the same expressive power as non-deterministic bottom-up ones; the transition rules are simply reversed, and the final states become the initial states.
10. In contrast, "'deterministic "'top-down tree automata are less powerful than their bottom-up counterparts, because in a deterministic tree automaton no two transition rules have the same left-hand side.
11. But, B點hi accepting condition is strictly weaker than other accepting conditions, i . e ., there exists a tree language which can be recognized by Muller accepting condition in infinite tree automata but can't be recognized by any B點hi accepting condition in some infinite tree automaton.
12. This is an important issue, as although non-deterministic ( ND ) top-down and ND bottom-up tree automata are equivalent in expressive power, deterministic top-down automata are strictly less powerful than their deterministic bottom-up counterparts, because tree properties specified by deterministic top-down tree automata can only depend on path properties . ( Deterministic bottom-up tree automata are as powerful as ND tree automata .)
13. This is an important issue, as although non-deterministic ( ND ) top-down and ND bottom-up tree automata are equivalent in expressive power, deterministic top-down automata are strictly less powerful than their deterministic bottom-up counterparts, because tree properties specified by deterministic top-down tree automata can only depend on path properties . ( Deterministic bottom-up tree automata are as powerful as ND tree automata .)
14. This is an important issue, as although non-deterministic ( ND ) top-down and ND bottom-up tree automata are equivalent in expressive power, deterministic top-down automata are strictly less powerful than their deterministic bottom-up counterparts, because tree properties specified by deterministic top-down tree automata can only depend on path properties . ( Deterministic bottom-up tree automata are as powerful as ND tree automata .)
更多例句：  下一頁